High Performance Multi-Party Computation for Binary Circuits Based on Oblivious Transfer
نویسندگان
چکیده
We present a unified view of the two-party and multi-party computation protocols based on oblivious transfer first outlined in Nielsen et al and Larraia et al. We present a number of modifications and improvements to these earlier presentations, as well as full proofs of the entire protocol. Improvements include a unified pre-processing and online MAC methodology, mechanisms to pass between different MAC methodologies, fixing a minor bug in the protocol of Larraia et al in relation to a selective failure attack.
منابع مشابه
Implementing Information-Theoretically Secure Oblivious Transfer from Packet Reordering
If we assume that adversaries have unlimited computational capabilities, secure computation between mutually distrusting players can not be achieved using an error-free communication medium. However, secure multi-party computation becomes possible when a noisy channel is available to the parties. For instance, the Binary Symmetric Channel (BSC) has been used to implement Oblivious Transfer (OT)...
متن کاملABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation
Secure computation enables mutually distrusting parties to jointly evaluate a function on their private inputs without revealing anything but the function’s output. Generic secure computation protocols in the semi-honest model have been studied extensively and several best practices have evolved. In this work, we design and implement a mixed-protocol framework, called ABY, that efficiently comb...
متن کاملSecure Two-Party Computation over a Z-Channel
In secure two-party computation, two mutually distrusting parties are interested in jointly computing a function, while preserving the privacy of their respective inputs. However, when communicating over a clear channel, security against computationally unbounded adversaries is impossible. Thus is the importance of noisy channels, over which we can build Oblivious Transfer (OT), a fundamental p...
متن کاملEfficient Secure Two - Party Protocols ”
This book provides a rigorous introduction to a smaller example of general secure multiparty computation (SMC), namely the case of two-party protocols. The approach is structured somewhat top-down: the authors first explain notions of security and security definitions for their chosen scenario, namely that of two-party protocols, with a static adversary, in the stand-alone model; then they look...
متن کاملLow Cost Constant Round MPC Combining BMR and Oblivious Transfer
In this work, we present two new universally composable, actively secure, constant round multi-party protocols for generating BMR garbled circuits with free-XOR and reduced costs. 1. Our first protocol takes a generic approach using any secret-sharing based MPC protocol for binary circuits, and a correlated oblivious transfer functionality. 2. Our specialized protocol uses secret-sharing based ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2015 شماره
صفحات -
تاریخ انتشار 2015